Joint message-passing decoding of ldpc codes and partial-response channels
نویسندگان
چکیده
Ideas of message passing are applied to the problem of removing the effects of intersymbol interference (ISI) from partial-response channels. Both bit-based and state-based parallel message-passing algorithms are proposed. For a fixed number of iterations less than the block length, the bit-error rate of the statebased algorithm approaches a nonzero constant as the signalto-noise ratio (SNR) approaches infinity. This limitation can be removed by using a precoder. It is well known that low-density parity-check (LDPC) codes can be decoded using a messagepassing algorithm. Here, a single message-passing detector/decoder matched to the combination of a partial-response channel and an LDPC code is investigated.
منابع مشابه
Efficient detection and decoding of q-ary LDPC coded signals over partial response channels
In this study, we consider the ways for concatenating the intersymbol interference (ISI) detector with a q-ary lowdensity parity-check (LDPC) decoder for transmissions over partial response (PR) channels. LDPC codes allow achieving performance close to the channel capacity in additive white Gaussian noise channels, while designing receivers employing these codes for transmissions over channels ...
متن کاملInterior Point Decoding for Linear Vector Channels
In this paper, a novel decoding algorithm for lowdensity parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels include many practically important channels such as inter symbol interference channels and partial response channels. It is shown that the maximum l...
متن کاملOn Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with the derivation of bounds on the conditional entropy of the transmitted codeword given the received sequence at the output of the parallel channels; the component channels are considered to be memoryless, binary-input, ...
متن کاملDesign of LDPC Codes Robust to Noisy Message-Passing Decoding
We address noisy message-passing decoding of lowdensity parity-check (LDPC) codes over additive white Gaussian noise channels. Message-passing decoders in which certain processing units iteratively exchange messages are common for decoding LDPC codes. The exchanged messages are in general subject to internal noise in hardware implementation of these decoders. We model the internal decoder noise...
متن کاملA Comparison Between LDPC Block and Convolutional Codes
LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellisbased decoding are irrelevant for message-passing decoders. In this paper, we undertake a comparison of LDPC...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2002